class Solution {
public:
    
    bool hostschedule(vector<vector<int> >& schedule) {
        int n=schedule.size();
        sort(schedule.begin(), schedule.end());
        for(int i=0;i<n-1;i++){
            if(schedule[i][1]<=schedule[i+1][0]) continue;
            else return false;
        }
        return true;
    }
};